Randomness Extraction Beyond the Classical World

نویسنده

  • Kai-Min Chung
چکیده

Randomness is an extremely useful resource in diverse fields in computer science, such as randomized algorithms, distributed algorithms, and cryptography. In these fields, we often assume that perfect randomness are available. However, the assumption may not be realistic, since random sources available in our physical world tend to be correlated and biased. Furthermore, there is no way to ensure or verify this assumption. Randomness extraction is a natural approach to bridge the gap, where we extract (almost) perfect randomness from weak random sources and assumptions. In this talk, I will present our recent progress on several randomness extraction approaches (beyond the “classical world”).

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Randomness Extraction via δ-Biased Masking in the Presence of a Quantum Attacker

Randomness extraction is of fundamental importance for information-theoretic cryptography. It allows to transform a raw key about which an attacker has some limited knowledge into a fully secure random key, on which the attacker has essentially no information. Up to date, only very few randomness-extraction techniques are known to work against an attacker holding quantum information on the raw ...

متن کامل

Randomness Extraction Via delta -Biased Masking in the Presence of a Quantum Attacker

Randomness extraction is of fundamental importance for information-theoretic cryptography. It allows to transform a raw key about which an attacker has some limited knowledge into a fully secure random key, on which the attacker has essentially no information. Up to date, only very few randomness-extraction techniques are known to work against an attacker holding quantum information on the raw ...

متن کامل

Bounded Randomness

We introduce some new variations of the notions of being Martin-Löf random where the tests are all clopen sets. We explore how these randomness notions relate to classical randomness notions and to degrees of unsolvability.

متن کامل

Robust Wagner–Whitin algorithm with uncertain costs

In real-world applications, costs for products are not deterministic: neither static nor dynamic. They actually tend to be non-stationary and cross-correlated. To overcome this drawback, there have been some efforts by researchers to extend the Wagner–Whitin algorithm to consider stochastic costs. However, they assume that the information of probability density function of random costs exists. ...

متن کامل

On the Impossibility of Extracting Classical Randomness Using a Quantum Computer

In this work we initiate the question of whether quantum computers can provide us with an almost perfect source of classical randomness, and more generally, suffice for classical cryptographic tasks, such as encryption. Indeed, it was observed [SV86,MP91,DOPS04] that classical computers are insufficient for either one of these tasks when all they have access to is a realistic imperfect source o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015